On state-alternating context-free grammars
نویسندگان
چکیده
The state-alternating context-free grammars are introduced, and the language classes obtained from them are compared to the classes of the Chomsky hierarchy as well as to some well-known complexity classes. In particular, the state-alternating context-free grammars are compared to the alternating context-free grammars of Moriya (1989) and to the alternating pushdown automata. Further, various derivation strategies are considered, and their influence on the expressive power of the (state-) alternating context-free grammars is investigated.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملOn Alternating Non-Context-Free Grammars
We study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.
متن کاملAlternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition
This paper shows that linear time μ-calculus with sequential composition defines exactly those properties that are expressible with alternating context-free grammars for ω-words. This helps to understand the expressive power of modal μ-calculus with a chop operator and provides a logical characterisation of the class of alternating context-free languages.
متن کاملOn the Complexity of Szilard Languages of Regulated Grammars
We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of regulated rewriting grammars. The main goal is to relate these languages to lowlevel complexity classes such asNC1 andNC2. We focus on the derivation process in random context grammars (RCGs) with context-free rules. We prove that unrestricted SZLs and leftmost-1 SZLs of RCGs ...
متن کاملFinite-State Approximation of Phrase Structure Grammars
Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state models are used instead, even though they lack expressive power. To reconcile those two alternatives, we designed an algorithm to compute finite-state approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 337 شماره
صفحات -
تاریخ انتشار 2005